Toward Wojda's conjecture on digraph packing
نویسندگان
چکیده
منابع مشابه
On the Tree Packing Conjecture
The Gyárfás tree packing conjecture states that any set of n−1 trees T1, T2, . . . , Tn−1 such that Ti has n− i+ 1 vertices pack into Kn (for n large enough). We show that t = 1 10n 1/4 trees T1, T2, . . . , Tt such that Ti has n− i+ 1 vertices pack into Kn+1 (for n large enough). We also prove that any set of t = 1 10 n1/4 trees T1, T2, . . . , Tt such that no tree is a star and Ti has n− i+ 1...
متن کاملHadwiger’s Conjecture and Seagull Packing
T he four-color theorem [1, 2] is one of the most well-known results in graph theory. Originating from the question of coloring a world map, posed in the middle of the nineteenth century, it has since fascinated hundreds of researchers and motivated a lot of beautiful mathematics. It states that every planar graph (that is, a graph that can be drawn in the plane without crossings) can be proper...
متن کاملUnion Closed Set Conjecture and Maximum Dicut in Connected Digraph
In this dissertation, we study the following two topics, i.e., the union closed set conjecture and the maximum edges cut in connected digraphs. The union-closed-set-conjecture-topic goes as follows. A finite family of finite sets is union closed if it contains the union of any two sets in it. Let XF = ∪F∈FF . A union closed family of sets is separating if for any two distinct elements in F , th...
متن کاملOn a graph packing conjecture by Bollobás, Eldridge and Catlin
Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets are disjoint. In 1978, Bollobás and Eldridge, and independently Catlin, conjectured that if (∆(G1)+1)(∆(G2)+1)≤ n+1, then G1 and G2 pack. Towards this conjecture, we show that for ∆(G1),∆(G2)≥ 300, if (∆(G1)+1)(∆(G2)+1)≤0.6n+1, then G1 and G2 pack. This is ...
متن کاملSufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles
Given a simple graph G = (V,E), a subset of E is called a triangle cover if it intersects each triangle of G. Let νt(G) and τt(G) denote the maximum number of pairwise edge-disjoint triangles in G and the minimum cardinality of a triangle cover of G, respectively. Tuza conjectured in 1981 that τt(G)/νt(G) ≤ 2 holds for every graph G. In this paper, using a hypergraph approach, we design polynom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Opuscula Mathematica
سال: 2017
ISSN: 1232-9274
DOI: 10.7494/opmath.2017.37.4.589